BARRAGE - Data Storage in BAR Model

Peer-to-peer networks have emerged as a relevant architecture for executing scientific computations. However, this kind of networks poses several problems. This thesis addresses the problem of data storage in a peer-to-peer architecture. We consider several distinct behaviors of the participating nodes. To deal with this variety, we use the BAR model, that comprises byzantine, rational, and altruist peers. In this report, we provide a survey on peer-to-peer storage solutions and on different approaches to deal with byzantine and rational peers. We also propose a new sub-system for data storage that tolerates byzantine behavior, by assuming an upper bound on the number of these nodes. It also provides incentives to rational peers to behave as desired, by constantly monitoring their actions, rewarding good behavior, and applying appropriate penalties to misbehaved nodes.